A probabilistic analysis of the dual bin packing problem

Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items

In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...

Probabilistic Analysis of Algorithms for Dual Bin Packing Problems

In the dual bin packing problem, the objective is to assign items of given size to the largest possible number of bins, subject to the constraint that the total size of the items assigned to any bin is at least equal to 1. We carry out a probabilistic analysis of this problem under the assumption that the items are drawn independently from the uniform distribution on [0, 11 and reveal the conne...

On Multi-dimensional Packing Problems

line and oo-line approximation algorithms for vector covering problems. analysis of algorithms for dual bin packing problems. packing can be solved within 1 + in linear time.gorithms for the m-dimensional 0-1 knapsack problem: worst-case and probabilistic analyses.schatz. Resource scheduling in enhanced pay-per-view continuous media databases. An eecient approximation scheme for the one-dimensi...

The 2-Dimensional Probabilistic Bin Packing Problem : An average case analysis of the FBS algorithm

In the probabilistic two-dimensional Bin Packing problem (2D-PBPP), one is asked to pack a random number of rectangular items, without overlap and any rotation, into the minimum number of identical square bins. In this paper we consider the re-optimization procedure used for solving probabilistic combinatorial optimization problems and an approximation of this strategy: the redistribution strat...

Probabilistic Analysis of a Generalized Bin Packing Problem and Applications